美国空军飞机战伤修理的发展及其对我们的启示

论述了美国空军战伤修理在方针、组织、培训、战伤修理规程、备件及工具箱、设计、试验数据库、新技术开发和常用抢修技术等方面的发展。同时提出了我空军战伤修理在这些方面的发展建议。     

移动式C3I系统导航定位问题的建模和仿真

未来战争是高新技术的对抗,我们要立于不败,就必须积极主动,知己知彼,避免被动挨打。为此,发展移动式Ｃ３Ｉ系统势在必行。移动式Ｃ３Ｉ系统的一个关键问题就是系统的导航定位问题的处理。作者立足实际,为移动式Ｃ３Ｉ系统建立了系统的导航定位问题的模型。针对引起系统导航定位的各种误差原因予以分析,建立了误差模型并进行了仿真,最后给出仿真结果     

基于MGEKF的单站无源定位跟踪算法

单站无源定位跟踪技术具有隐蔽性强、设备简单,系统相对独立等优点,有着广阔的应用前景.为了提高定位精度和收敛速度以满足实时化需求,在现有的基于多普勒变化率的单站无源定位算法的基础上.详细推导了基于MGEKF的定位算法以解决EKF算法的不稳定性,并通过计算机仿真比较了两种算法的性能,结果表明MGEKF定位算法提高了定位精度、收敛速度和稳定度,定位结果能够满足实际需求.     

异构资源类型下多无人机任务分配

针对多无人机在执行侦察、打击任务的过程中携带任务资源的异构性,以及任务对于异构资源的要求,设计了一种改进的基于共识的捆绑算法(consensus-based bundle algorithm, CBBA)。考虑任务价值、任务执行时间窗以及航程代价等条件建立了多无人机对地目标侦察、打击任务分配模型。利用K-medoids聚类分析方法对多无人机进行基于距离和携带资源平衡的聚类,以解决多无人机对于异构资源类型的要求。对打击任务进行子任务生成,并利用改进后的CBBA求解所建立的任务分配模型,通过对比仿真实验验证了算法的可行性和有效性。     

依据噪声能量变化提取目标运动信息的方法

在对被动噪声声纳接收的噪声能量随时间的变化规律分析的基础上,从理论上分析噪声能量的变化与目标运动参数关系,给出了其中所含目标运动信息的提取方法.     

一种多方位一距离目标定位的最小二乘伴随估计器

对纯方位最小二乘估计器,在已知某时刻一个观测距离的情况下,导出了一种伴随型的目标速度估计器．该算法嵌入原最小二乘估计器之中,计算简单且便于工程应用．     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

动基站时差探测系统定位方法研究

针对传统长基线时差探测系统的缺点,提出了全新的动基站时差测量系统并给出了目标的定位原理。在典型布站、信息存在冗余的前提下,通过子集选优法确定了最佳定位算法,并根据工程应用的需要确定了更加合理简捷的定位算法,统计仿真表明了该算法的有效性。最后,计算了目标高度测量精度并归纳了其特点,给出了有益的结论。